Constrained Epsilon-Minimax Test for Simultaneous Detection and Classification
نویسندگان
چکیده
منابع مشابه
Simultaneous feature selection and classification via Minimax Probability Machine
This paper presents a novel method for simultaneous feature selection and classification by incorporating a robust L1-norm into the objective function of Minimax Probability Machine (MPM). A fractional programming framework is derived by using a bound on the misclassification error involving the mean and covariance of the data. Furthermore, the problems are solved by the Quadratic Interpolation...
متن کاملislanding detection methods for microgrids
امروزه استفاده از منابع انرژی پراکنده کاربرد وسیعی یافته است . اگر چه این منابع بسیاری از مشکلات شبکه را حل می کنند اما زیاد شدن آنها مسائل فراوانی برای سیستم قدرت به همراه دارد . استفاده از میکروشبکه راه حلی است که علاوه بر استفاده از مزایای منابع انرژی پراکنده برخی از مشکلات ایجاد شده توسط آنها را نیز منتفی می کند . همچنین میکروشبکه ها کیفیت برق و قابلیت اطمینان تامین انرژی مشترکان را افزایش ...
15 صفحه اولConstrained forms of statistical minimax :
A fundamental quantity in statistical decision theory is the notion of the minimax risk as5 sociated with an estimation problem. It is based on a saddlepoint problem, in which nature plays the 6 role of adversary in choosing the underlying problem instance, and the statistician seeks an estimator 7 with good properties uniformly over a class of problem instances. We argue that in many modern 8 ...
متن کاملMinimax Gaussian Classification & Clustering
We present minimax bounds for classification and clustering error in the setting where covariates are drawn from a mixture of two isotropic Gaussian distributions. Here, we define clustering error in a discriminative fashion, demonstrating fundamental connections between classification (supervised) and clustering (unsupervised). For both classification and clustering, our lower bounds show that...
متن کاملConstrained Minimax Optimization of Continuous Search Efforts for the Detection of a Stationary Target
Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2011
ISSN: 0018-9448
DOI: 10.1109/tit.2011.2170114